Generating linear extensions of posets by transpositions
نویسنده
چکیده
This paper considers the problem of listing all linear extensions of a partial order so that successive extensions diier by the transposition of a single pair of elements. A necessary condition is given for the case when the partial order is a forest. A necessary and suucient condition is given for the case where the partial order consists of disjoint chains. Some open problems are mentioned.
منابع مشابه
Mining Posets from Linear Orders
There has been much research on the combinatorial problem of generating the linear extensions of a given poset. This paper focuses on the reverse of that problem, where the input is a set of linear orders, and the goal is to construct a poset or set of posets that generates the input. Such a problem finds applications in computational neuroscience, systems biology, paleontology, and physical pl...
متن کاملEquality of P -partition Generating Functions
To every labeled poset (P, ω), one can associate a quasisymmetric generating function for its (P, ω)-partitions. We ask: when do two labeled posets have the same generating function? Since the special case corresponding to skew Schur function equality is still open, a complete classification of equality among (P, ω) generating functions is likely too much to expect. Instead, we determine necess...
متن کاملCounterexamples to the Poset Conjectures of Neggers, Stanley, and Stembridge
We provide the first counterexamples to Neggers’ 1978 conjecture and Stembridge’s 1997 conjecture that the generating functions for descents and peaks in the linear extensions of naturally labeled posets should have all real zeros. We also provide minimum-sized counterexamples to a generalization of the Neggers conjecture due to Stanley that was recently disproved by Brändén.
متن کاملNote on a Ramsey Theorem for Posets with Linear Extensions
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao (2017).
متن کاملShift Gray Codes
Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1s2⋯sn, the right-shift operation ÐÐ→ shift(s, i, j) replaces the substring sisi+1⋯sj by si+1⋯sjsi. In other words, si is right-shifted into position j by applying the permutation (j j−1 ⋯ i) to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 54 شماره
صفحات -
تاریخ انتشار 1992